-
1 детальная программа
Русско-английский большой базовый словарь > детальная программа
-
2 подробный алгоритм
алгоритмическая схема; схема алгоритма — algorithmic diagram
алгоритм тестирования; алгоритм проверки — testing algorithm
Русско-английский большой базовый словарь > подробный алгоритм
-
3 вычислительный алгоритм
1. computational algorithm2. computing algorithm3. computational schemeРусско-английский большой базовый словарь > вычислительный алгоритм
-
4 устойчивый алгоритм
1. robust algorithm2. durable algorithmРусско-английский большой базовый словарь > устойчивый алгоритм
-
5 живучий алгоритм
1. robust algorithmалгоритмическая схема; схема алгоритма — algorithmic diagram
алгоритм тестирования; алгоритм проверки — testing algorithm
2. durable algorithmРусско-английский большой базовый словарь > живучий алгоритм
-
6 детерминированный алгоритм
Русско-английский большой базовый словарь > детерминированный алгоритм
-
7 прямодвойственный алгоритм
Русско-английский большой базовый словарь > прямодвойственный алгоритм
-
8 релаксационный алгоритм
Русско-английский большой базовый словарь > релаксационный алгоритм
-
9 селективный алгоритм
Русско-английский большой базовый словарь > селективный алгоритм
-
10 детальная программа
1) Information technology: digit-by-digit algorithm (действий), digit-by-digit algorithm2) Caspian: blueprintУниверсальный русско-английский словарь > детальная программа
-
11 подробный алгоритм
Information technology: digit-by-digit algorithmУниверсальный русско-английский словарь > подробный алгоритм
-
12 Отсутствие артиклей перед существительными, которые снабжены ссылками
It follows from Theorem 1 that $x=1$Section 2 of this paper gives (contains) a concise presentation of the notation to be used belowProperty 1 is called (known as) the triangle inequalityThis assertion (statement, proposition) has been proved in part 1 (part (a)) of the (our) proofAlgorithm 1 (с большой буквы) defines elementary permutations and elementary triangle matrices of index 2Equation (1) ((the) inequality (1)) can thus be written in the (артикль обязателен) form (2)In the language of our notation, algorithm (1) (с маленькой буквы) is a stable way of computing the inner productThe only place where the algorithm can break down is in statement 3 (in Statement 3)We combine Exercises 1 and 2 to construct an algorithm for finding an approximate eigenvectorThis case is illustrated in (но не on) Figure 1The asymptotic formula (1) was proved in Example 1Corollary 1 can be used to estimate the error in the inverse of a perturbed matrixBy property 1 (by Theorem 1), this function is positive except at the zero vectorA less trivial example is given in Appendix 3Step 1 in Example 1 and steps 2 and 3 in Example 2The idea of a norm will be introduced in Chapter 4Now from statements 2 and 3 of (1), we have...All the drivers for solving linear systems are listed in Table 1 (are illustrated in Figure 1)If Algorithm 1 in four-digit arithmetic is applied to refine $x$, then we obtain...Assertion (ii) is nothing but the statement that one natural way of extending these ideas to $R^n$ is to generalize formula (1) to obtain a Euclidean length of a vectorBy property 1, this function is positive except at the zero vectorWe have seen on page 3 that set of matrices is a vector space which is essentially identical with...Equation (1) effectively gives an algorithm for using the output of Algorithm 1 to solve...Русско-английский словарь по прикладной математике и механике > Отсутствие артиклей перед существительными, которые снабжены ссылками
См. также в других словарях:
Multiplication algorithm — A multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are in use. Efficient multiplication algorithms have existed since the advent of the decimal system.… … Wikipedia
Check digit — A check digit is a form of redundancy check used for error detection, the decimal equivalent of a binary checksum. It consists of a single digit computed from the other digits in the message. With a check digit, one can detect simple errors in… … Wikipedia
Luhn algorithm — The Luhn algorithm or Luhn formula, also known as the modulus 10 or mod 10 algorithm, is a simple checksum formula used to validate a variety of identification numbers, such as credit card numbers, IMEI numbers, National Provider Identifier… … Wikipedia
Karatsuba algorithm — The Karatsuba multiplication algorithm, a technique for quickly multiplying large numbers, was discovered by Anatolii Alexeevich Karatsuba in 1960 and published in the joint paper with Yu. Ofman in 1962. It reduces the multiplication of two n… … Wikipedia
Verhoeff algorithm — The Verhoeff algorithm, a checksum formula for error detection first published in 1969, was developed by Dutch mathematician Jacobus Verhoeff (born 1927). Like the more widely known Luhn algorithm, it works with strings of decimal digits of any… … Wikipedia
Sorting algorithm — In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other… … Wikipedia
Cooley-Tukey FFT algorithm — The Cooley Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N 1 N 2 in terms of smaller… … Wikipedia
Cooley–Tukey FFT algorithm — The Cooley–Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N1N2 in terms of smaller DFTs… … Wikipedia
Shifting nth-root algorithm — The shifting nth root algorithm is an algorithm for extracting the n th root of a positive real number which proceeds iteratively by shifting in n digits of the radicand, starting with the most significant, and produces one digit of the root on… … Wikipedia
Quine–McCluskey algorithm — The Quine–McCluskey algorithm (or the method of prime implicants) is a method used for minimization of boolean functions which was developed by W.V. Quine and Edward J. McCluskey. It is functionally identical to Karnaugh mapping, but the tabular… … Wikipedia
Lehmer's GCD algorithm — Lehmer s GCD algorithm, named after Derrick Henry Lehmer, is a rather fast GCD algorithm, an improvement on the simpler but slower Euclidean algorithm. Algorithm Lehmer noted that that most of the quotients from each step of the division part of… … Wikipedia